1 link tagged with all of: database + query engine + vectorized execution + turbopuffer
Click any tag below to further narrow down your results
Links
turbopuffer is rebuilding its query engine so every query runs through a batch-oriented vectorized pipeline, borrowing an approach usually found in analytical databases like DuckDB. The team argues search engines have skipped this because they ran narrow ranking loops, but customer queries now combine filters, boosts, and aggregations that make operator dispatch a real cost.
- Volcano-style row-at-a-time execution wastes CPU on per-row function calls and dispatch; vectorized engines process cache-friendly batches to cut that overhead.
- Traditional search algorithms like block-max WAND and HNSW resist vectorization because each similarity result decides what to examine next, creating data dependencies the CPU can't predict.
- turbopuffer v1 had one similarity operator, but customers now stack filters, recency decay, aggregations, and custom scoring, so the query plans are heterogeneous enough to justify the switch.